Approaches to Independence Friendly Modal Logic

نویسندگان

  • Tero Tulenheimo
  • Merlijn Sevenster
چکیده

The aim of the present paper is to discuss two different approaches for formulating independence friendly (IF) modal logic. In one of them, the language of basic modal logic is enriched with the slash notation familiar from IF first-order logics, and the resulting logic is interpreted in terms of games and uniform strategies. A different approach is formulated in the present paper: an IF modal logic is defined by imposing conditions on its structural relationships to other logics, namely a specified modal logic (say, basic modal logic), its first-order correspondence language, and IF logic. We compare logics emerging from the two approaches. More generally, the issue of the Eigenart of IF modal logics is addressed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On independence-friendly fixpoint logics

We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi. Philosophia Scientiæ, 8 (2), 2004, 125–144.

متن کامل

UvA - DARE ( Digital Academic Repository ) Compositional natural language semantics using Independence Friendly Logic or Dependence Logic

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics...

متن کامل

Compositional Natural Language Semantics using Independence Friendly Logic or Dependence Logic

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics...

متن کامل

Logic and Communication in Multi-Agent Systems

To express knowledge and communication in multi-agents systems, a hybrid of possible-worlds and game-theoretic semantics is defined for the language of independence-friendly (IF) first-order epistemic logic. The language distinguishes between specific and non-specific knowledge by hiding worlds. Identification on stratified domains is via imperfect information that agrees with cross-world refer...

متن کامل

Computational Aspects of Dependence Logic

In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko Väänänen as an extension of first-order (resp. modal) logic by the dependence operator “p ̈q. For first-order (resp. propositional) variables x1, . . . , xn, “px1, . . . , xn ́1, xnq intuitively states that the value of xn is determined by those of x1, . . . , xn ́1. We consider fragments of modal dependenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006